Consistency-preserving propagation for SMT solving of concurrent program verification

The happens-before orders have been widely adopted to model thread interleaving behaviors of concurrent programs. A dedicated ordering theory solver, usually composed propagation, consistency checking, and conflict clause generation, plays a central role in program verification. We propose novel preventive reasoning approach that automatically preserves the makes checking generation omissible. implement our prototype tool conduct experiments on credible benchmarks; results reveal significant improvement over existing state-of-the-art verifiers.